Diagrammatic syntax for algebra
نویسنده
چکیده
Boolean circuits are used to represent programs on finite data. Reversible Boolean circuits and quantum Boolean circuits have been introduced to modelize some physical aspects of computation. Those notions are essential in complexity theory, but we claim that a deep mathematical theory is needed to make progress in this area. For that purpose, the recent developments of knot theory is a major source of inspiration. Following the ideas of Burroni, we consider logical gates as generators for some algebraic structure with two compositions, and we are interested in the relations satisfied by those generators. For that purpose, we introduce canonical forms and rewriting systems. Up to now, we have mainly studied the basic case and the linear case, but we hope that our methods can be used to get presentations by generators and relations for the (reversible) classical case and for the (unitary) quantum case.
منابع مشابه
Toward a Physics of Equations
Papers on diagrammatic reasoning often begin by dividing marks on paper into two basic classes: diagrams and sentences. While endorsing the perspective that a reasoning episode can be diagrammatic or sentential, I will give an overview of recent evidence suggesting that apparently symbolic expressions in algebra and arithmetic are frequently treated as diagrammatic or even pictorial depictions ...
متن کاملOn Diagram Tokens and Types
Rejecting the temptation to make up a list of necessary and sufficient conditions for diagrammatic and sentential systems, we present an important distinction which arises from sentential and diagrammatic features of systems. Importantly, the distinction we will explore in the paper lies at a meta-level. That is, we argue for a major difference in metatheory between diagrammatic and sentential ...
متن کاملTeleportation, Braid Group and Temperley–Lieb Algebra
In the paper, we describe the teleportation from the viewpoints of the braid group and Temperley–Lieb algebra. We propose the virtual braid teleportation which exploits the teleportation swapping and identifies unitary braid representations with universal quantum gates, and further suggest the braid teleportation which is explained in terms of the crossed measurement and the state model of knot...
متن کاملAlgebraic Structures Underlying Quantum Information Protocols
In this paper, we describe the teleportation from the viewpoints of the braid group and Temperley–Lieb algebra. We propose the virtual braid teleportation which exploits the teleportation swapping and identifies unitary braid representations with universal quantum gates, and suggest the braid teleportation which is explained in terms of the crossed measurement and the state model of knot theory...
متن کاملDiagrammatic representations in domain-specific languages
One emerging approach to reducing the labour and costs of software development favours the specialisation of techniques to particular application domains. The rationale is that programs within a given domain often share enough common features and assumptions to enable the incorporation of substantial support mechanisms into domain-specific programming languages and associated tools. Instead of ...
متن کاملQuantomatic: A Proof Assistant for Diagrammatic Reasoning
Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have applications in many areas including categorical algebra, programming language semantics, representation theory, algebraic quantum information, and quantum groups. String diagrams provide a convenient graphical syntax for reasoning formally about such structures, while avoid...
متن کامل